منابع مشابه
Packing fraction of geometric random packings of discretely sized particles.
The packing fraction of geometric random packings of discretely sized particles is addressed in the present paper. In an earlier paper [Brouwers, Phys. Rev. E 74, 031309 (2006); Brouwers, Phys. Rev. E 74, 069901(E) (2006)], analytical solutions were presented for the packing fraction of polydisperse geometric packings for discretely sized particles with infinitely large size ratio and the packi...
متن کاملThe random packing density of nearly spherical particles.
Obtaining general relations between macroscopic properties of random assemblies, such as density, and the microscopic properties of their constituent particles, such as shape, is a foundational challenge in the study of amorphous materials. By leveraging existing understanding of the random packing of spherical particles, we estimate the random packing density for all sufficiently spherical sha...
متن کاملWall Effect in 3D Simulation Of Same Sized Particles Packing
In this paper, the effects of container size on the porosity of random loose packing of mono size particles have been investigated using an Event Dynamics (ED) based model. Simultaneous effects of square container walls on particles packing and their order are also investigated. Our simulation results indicate higher container size will increase the total packing factor and high density regions...
متن کاملRandom-order bin packing
An instance of the classical bin packing problem consists of a positive real C and a list L = (a1, a2, ..., an) of items with sizes 0 < s(ai) ≤ C, 1 ≤ i ≤ n; a solution to the problem is a partition of L into a minimum number of blocks, called bins, such that the sum of the sizes of the items in each bin is at most the capacity C. The capacity is just a scaling parameter; as is customary, we pu...
متن کاملPacking Random Intervals
Let n random intervals I 1 ; : : : ; I n be chosen by selecting end-points independently from the uniform distribution on 0; 1]. A packing is a pairwise disjoint subset of the intervals; its wasted space is the Lebesgue measure of the points of 0; 1] not covered by the packing. In any set of intervals the packing with least wasted space is computa-tionally easy to nd; but its expected wasted sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Powder Technology
سال: 2013
ISSN: 0032-5910
DOI: 10.1016/j.powtec.2012.09.015